package uestc.lj.basic.graph;

import java.util.HashSet;
import java.util.Stack;

/**
 * 深度优先遍历
 *
 * @Author:Crazlee
 * @Date:2021/11/24
 */
public class Code02_DFS {
	/**
	 * 深度优先遍历
	 *
	 * @param node 图中的一个节点
	 */
	public static void dfs(Node node) {
		if (node == null) {
			return;
		}
		Stack<Node> stack = new Stack<>();
		HashSet<Node> set = new HashSet<>();

		stack.add(node);
		set.add(node);
		System.out.println(node.value);

		while (!stack.isEmpty()) {
			Node cur = stack.pop();
			for (Node next : cur.nexts) {
				if (!set.contains(next)) {
					stack.push(cur);
					stack.push(next);
					set.add(next);
					System.out.println(next.value);
					break;
				}
			}
		}
	}
}
